Domination for Latin Square Graphs
نویسندگان
چکیده
In combinatorics, a latin square is $$n\times n$$ matrix filled with n different symbols, each occurring exactly once in row and column. Associated to square, we can define simple graph called graph. this article, compute lower upper bounds for the domination number k-tuple total numbers of such graphs. Moreover, describe formula 2-tuple number.
منابع مشابه
Random Latin square graphs
In this paper we introduce new models of random graphs, arising from Latin squares which include random Cayley graphs as a special case. We investigate some properties of these graphs including their clique, independence and chromatic numbers, their expansion properties as well as their connectivity and Hamiltonicity. The results obtained are compared with other models of random graphs and seve...
متن کاملOn chromatic number of Latin square graphs
The chromatic number of a Latin square is the least number of partial transversals which cover its cells. This is just the chromatic number of its associated Latin square graph. Although Latin square graphs have been widely studied as strongly regular graphs, their chromatic numbers appear to be unexplored. We determine the chromatic number of a circulant Latin square, and find bounds for some ...
متن کاملA class of orthogonal latin square graphs
An orthogonal latin square graph is a graph whose vertices are latin squares of the same order, adjacency being synonymous with orthogonality. We are interested in orthogonal latin square graphs in which each square is orthogonal to the Cayley table M of a group G and is obtained from M by permuting columns. These permutations, regarded as permutations of G, are orthomorphisms of G and the grap...
متن کاملRepresentations of graphs and orthogonal latin square graphs
We define graph representations modulo integers and prove that any finite graph has a representation modulo some integer. We use this to obtain a new, simpler proof of Lindner, E. Mendelsohn, N. Mendelsohn, and Wolk’s result that any finite graph can be represented as an orthogonal latin square graph. Let G be a graph with vertices v,, . . . , u, and let n be a natural number. We say that G is ...
متن کاملAmorphic association schemes with negative Latin square-type graphs
Applying results from partial difference sets, quadratic forms, and recent results of Brouwer and Van Dam, we construct the first known amorphic association scheme with negative Latin square type graphs and whose underlying set is a nonelementary abelian 2-group. We give a simple proof of a result of Hamilton that generalizes Brouwer’s result. We use multiple distinct quadratic forms to constru...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Graphs and Combinatorics
سال: 2021
ISSN: ['1435-5914', '0911-0119']
DOI: https://doi.org/10.1007/s00373-021-02297-7